Sparse Polynomial Approximations for Affine Parametric Saddle Point Problems
نویسندگان
چکیده
In this work we study convergence properties of sparse polynomial approximations for a class affine parametric saddle point problems, including the Stokes equations viscous incompressible flow, mixed formulation diffusion groundwater time-harmonic Maxwell electromagnetics, etc. Due to lack knowledge or intrinsic randomness, (viscosity, diffusivity, permeability, permittivity, etc.) coefficients such problems are uncertain and can often be represented approximated by high- countably infinite-dimensional random parameters equipped with suitable probability distributions, affinely depend on series either globally locally supported basis functions, e.g., Karhunen–Loève expansion, piecewise polynomials, adaptive wavelet approximations. We consider solutions, in particular Taylor approximations, their these problems. Under sparsity assumptions parametrization coefficients, show algebraic rates O(N−r) solutions based results elliptic PDEs (Cohen, A. et al.: Anal. Appl. 9, 11–47, 2011), (Bachmayr, M., ESAIM Math. Model. Numer. 51, 321–339, 2017), A., DeVore, R.: Acta 24, 1–159, 2015), (Chkifa, J. Pures 103, 400–428, 47, 253–280, 2013), Migliorati, G.: Contemp. Comput. Math., 233–282, 2018), rate r depending only parameter parametrization, not number active dimensions terms N. note that were considered 2015, Section 2.2) anticipation same approximation solution map obtained extended more general paper, different from presented 2.2), obtain two variables, velocity pressure equations, which case functions.
منابع مشابه
Preconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملSparse spectral approximations for computing polynomial functionals
We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral eigenfunctions that turns out to be satisfied in many cases, including the Fourier and Hermite basis. MSC numbers: 65D15, 65M70, 33C45.
متن کاملSubstructure Preconditioners for Elliptic Saddle Point Problems
Domain decomposition preconditioners for the linear systems arising from mixed finite element discretizations of second-order elliptic boundary value problems are proposed. The preconditioners are based on subproblems with either Neumann or Dirichlet boundary conditions on the interior boundary. The preconditioned systems have the same structure as the nonpreconditioned systems. In particular, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vietnam journal of mathematics
سال: 2022
ISSN: ['2305-221X', '2305-2228']
DOI: https://doi.org/10.1007/s10013-022-00584-1